Vinogradov's theorem with almost equal summands
نویسندگان
چکیده
منابع مشابه
Multivariate Compounds with Equal Number of Summands
The paper considers multivariate discrete random sums with equal number of summands. Such distributions describe the total claim amount received by a company in a fixed time point. In Queuing theory they characterize cumulative waiting times of customers up to time t. In Theory of branching processes they model the number of heirs at a fixed point in time. Here some general properties and formu...
متن کاملCramer's Theorem for Nonnegative Summands
We clarify the boundary effect in Cramer’s theorem on the Large Deviations Principle (LDP) for normed sums of non-negative i.i.d. random variables Sn = 1 n ∑ n i=1 ξi. We show that the LDP holds true with the rate function possibly infinite at the boundary point x = 0. We also consider a continuous time version of Cramer’s theorem with nonnegative summands St = 1 t ∑ i:τi≤t ξi, t → ∞, where (τi...
متن کاملSums of almost equal prime squares
In this short note, we prove that almost all integers N satisfying N ≡ 3 (mod 24) and 5 -N or N ≡ 4 (mod 24) is the sum of three or four almost equal prime squares, respectively: N = p21 + · · ·+ p 2 j with |pi − (N/j) 1/2| ≤ N1/2−9/80+ε for j = 3 or 4 and 1 ≤ i ≤ j.
متن کاملIndefinite summation with unspecified summands
We provide a new algorithm for indefinite nested summation which is applicable to summands involving unspecified sequences x(n). More than that, we show how to extend Karr’s algorithm to a general summation framework by which additional types of summand expressions can be handled. Our treatment of unspecified sequences can be seen as a first illustrative application of this approach.
متن کاملThe Folk Theorem for Games with Private Almost-Perfect Monitoring∗
We prove the folk theorem for discounted repeated games under private, almost-perfect monitoring. Our result covers all finite, n-player games satisfying the usual full-dimensionality condition. Mixed strategies are allowed in determining the individually rational payoffs. We assume no cheap-talk communication between players and no public randomization device.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the London Mathematical Society
سال: 2017
ISSN: 0024-6115
DOI: 10.1112/plms.12040